Cycle graph

Results: 143



#Item
51Partitioning a graph into a cycle and an anticycle, a proof of Lehel’s conjecture St´ephane Bessy and St´ephan Thomass´e∗ Abstract We prove that every graph G has a vertex partition into a cycle and an anticycle (

Partitioning a graph into a cycle and an anticycle, a proof of Lehel’s conjecture St´ephane Bessy and St´ephan Thomass´e∗ Abstract We prove that every graph G has a vertex partition into a cycle and an anticycle (

Add to Reading List

Source URL: perso.ens-lyon.fr

Language: English - Date: 2011-08-22 06:36:00
    52Design and Analysis of Algorithms CS681 Fall 2007 Christofides’s Algorithm Sunday, October 28, 2007

    Design and Analysis of Algorithms CS681 Fall 2007 Christofides’s Algorithm Sunday, October 28, 2007

    Add to Reading List

    Source URL: vigna.di.unimi.it

    Language: English - Date: 2014-10-22 08:43:20
    53November 18, Fall 2009 Quiz 2 Introduction to Algorithms Massachusetts Institute of Technology

    November 18, Fall 2009 Quiz 2 Introduction to Algorithms Massachusetts Institute of Technology

    Add to Reading List

    Source URL: courses.csail.mit.edu

    Language: English - Date: 2010-02-02 11:52:14
    54THEOREM OF THE DAY Ore’s Theorem in Graph Theory Let G be a simple connected graph with n vertices, 3 ≤ n. Suppose that for any pair of nonadjacent vertices their degrees total at least n. Then G has a Hamilton cycle

    THEOREM OF THE DAY Ore’s Theorem in Graph Theory Let G be a simple connected graph with n vertices, 3 ≤ n. Suppose that for any pair of nonadjacent vertices their degrees total at least n. Then G has a Hamilton cycle

    Add to Reading List

    Source URL: www.theoremoftheday.org

    Language: English - Date: 2015-02-25 10:49:29
      55Chapter 11 Traveling Salesman Here we study the classical Traveling Salesman problem: Given a complete graph G = (V, E) on n vertices with non-negative edge cost c : E → R+ find a tour T , P i.e., a cycle

      Chapter 11 Traveling Salesman Here we study the classical Traveling Salesman problem: Given a complete graph G = (V, E) on n vertices with non-negative edge cost c : E → R+ find a tour T , P i.e., a cycle

      Add to Reading List

      Source URL: www2.informatik.hu-berlin.de

      Language: English - Date: 2014-06-25 03:14:23
        56WTF: The Who to Follow Service at Twitter Pankaj Gupta, Ashish Goel, Jimmy Lin, Aneesh Sharma, Dong Wang, Reza Zadeh Twitter, Inc. @pankaj @ashishgoel @lintool @aneeshs @dongwang218 @reza_zadeh ABSTRACT

        WTF: The Who to Follow Service at Twitter Pankaj Gupta, Ashish Goel, Jimmy Lin, Aneesh Sharma, Dong Wang, Reza Zadeh Twitter, Inc. @pankaj @ashishgoel @lintool @aneeshs @dongwang218 @reza_zadeh ABSTRACT

        Add to Reading List

        Source URL: www2013.wwwconference.org

        Language: English - Date: 2014-07-21 08:47:06
        57On degree sequences forcing the square of a Hamilton cycle Katherine Staden (University of Birmingham) Many famous results in extremal graph theory give minimum degree conditions that force some substructure. For example

        On degree sequences forcing the square of a Hamilton cycle Katherine Staden (University of Birmingham) Many famous results in extremal graph theory give minimum degree conditions that force some substructure. For example

        Add to Reading List

        Source URL: web.mat.bham.ac.uk

        - Date: 2014-11-06 06:41:59
          58Enclosing and Existence of Cycle Systems Chris Rodger Auburn University Graph Decompositions

          Enclosing and Existence of Cycle Systems Chris Rodger Auburn University Graph Decompositions

          Add to Reading List

          Source URL: conferences.science.unsw.edu.au

          Language: English - Date: 2012-12-17 05:45:28
            59Demonstrating Interactive Multi-resolution Large Graph Exploration Zhiyuan Lin College of Computing Georgia Tech Atlanta, GA, USA

            Demonstrating Interactive Multi-resolution Large Graph Exploration Zhiyuan Lin College of Computing Georgia Tech Atlanta, GA, USA

            Add to Reading List

            Source URL: www.cc.gatech.edu

            Language: English - Date: 2014-03-20 03:09:27
            60Partitioning two-coloured complete multipartite graphs into monochromatic paths and cycles Oliver Schaudt Institut f¨ ur Informatik, Universit¨at zu K¨oln, K¨oln, Germany

            Partitioning two-coloured complete multipartite graphs into monochromatic paths and cycles Oliver Schaudt Institut f¨ ur Informatik, Universit¨at zu K¨oln, K¨oln, Germany

            Add to Reading List

            Source URL: www.zaik.uni-koeln.de

            Language: English - Date: 2014-10-02 11:19:31